Creation of Ballot Sequences in a Periodic Cellular Automaton
نویسندگان
چکیده
منابع مشابه
Creation of ballot sequences in a periodic cellular automaton
Motivated by an attempt to develop a method for solving initial value problems in a class of integrable cellular automata associated with crystal bases, we consider a generalization of a simple theorem in combinatorics. The original theorem asserts that any sequence of letters 1 and 2, and having no less 1’s than 2’s, can be changed into a ballot sequence via cyclic shifts only. Our theorem tre...
متن کاملOn a Periodic Soliton Cellular Automaton
We propose a box and ball system with a periodic boundary condition (pBBS). The time evolution rule of the pBBS is represented as a Boolean recurrence formula, an inverse ultradiscretization of which is shown to be equivalent with the algorithm of the calculus for the 2Nth root. The relations to the pBBS of the combinatorial R matrix of U q(A (1) N ) are also discussed.
متن کاملA Cellular Automaton Based Algorithm for Mobile Sensor Gathering
In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...
متن کاملGeneralized ballot sequences are ascent sequences
Ascent sequences were introduced by the author (in conjunction with others) to encode a class of permutations that avoid a single lengththree bivincular pattern, and were the central object through which other combinatorial correspondences were discovered. In this note we prove the non-trivial fact that generalized ballot sequences are ascent sequences. Ascent sequences were introduced in [1] t...
متن کاملBallot Sequences and a Determinant of Good's
where A = [uVlnxn with aU = 6i,ji + hi_ ,,j, C = I n-‘J, I is the n x n identity matrix and J is the n x n matrix of all 1’s. This determinant arises in the calculation of cumulants of a statistic analogous to Pearson’s chisquared for a multinomial sample (Sibson [5]), and its value has been conjectured by Good [2]. In this paper we use enumerative methods to prove Good’s conjecture. The partic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Physical Society of Japan
سال: 2009
ISSN: 0031-9015,1347-4073
DOI: 10.1143/jpsj.78.024003